The convergence of accelerated overrelaxation iterations

نویسندگان

چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

On convergence of the generalized accelerated overrelaxation method

In this paper, we study the convergence of the generalized accelerated overrelaxation (GAOR) iterative method. That is an extension of the classical convergence result of the generalized successive overrelaxation (GSOR) iterative method. We proposed some theorems, which they obtain better results than similar works. By some numerical examples we show the goodness of our results. 2006 Elsevier I...

متن کامل

On the Accelerated Overrelaxation Method

A new variant of the accelerated over relaxation (AOR) method for solving systems of linear algebraic equations, the KAOR method is established. The treatment depends on the use of the extrapolation techniques introduced by Hadjidimos (1978) and the KSOR introduced by Youssef (2012) and its modified version published in (2013). The KAOR is an extrapolation version of the KSOR. This approach has...

متن کامل

Accelerated Overrelaxation Method

This paper describes a method for the numerical solution of linear systems of equations. The method is a two-parameter generalization of the Successive Overrelaxation (SOR) method such that when the two parameters involved are equal it coincides with the SOR method. Finally, a numerical example is given to show the superiority of the new method.

متن کامل

Optimum Accelerated Overrelaxation Method

In this paper we give the optimum parameters for the Accelerated Overrelaxation (AOR) method in the special case where the matrix coefficient of the linear system, which is solved, is consistently ordered with nonvanishing diagonal elements. Under certain assumptions, concerning the eigenvalues of the corresponding Jacobi matrix, it is shown that the optimum AOR method gives better convergence ...

متن کامل

Convergence of Iterations

Convergence is a central problem in both computer science and in population biology. Will a program terminate? Will a population go to an equilibrium? In general these questions are quite difficult – even unsolvable. In this paper we will concentrate on very simple iterations of the form

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Mathematics of Computation

سال: 1986

ISSN: 0025-5718

DOI: 10.1090/s0025-5718-1986-0842131-9